A Vectorization Scheme for Nonconvex Set Optimization Problems

In this paper, we study a solution approach for set optimization problems with respect to the lower less relation. This can serve as base numerically solving by using established solvers from multiobjective optimization. Our strategy consists of deriving parametric family whose optimal sets approximate, in specific sense, that set-valued problem arbitrary accuracy. We also examine particular classes mappings which corresponding is equivalent generated family. Surprisingly, includes convex graph.